Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
نویسندگان
چکیده
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
منابع مشابه
Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time ap...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملSeries-parallel subgraphs of planar graphs
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected (respectively, 2-edge-connected) spanning partial 2-tree (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs.
متن کاملFinding k-Connected Subgraphs with Minimum Average Weight
We consider the problems of finding k-connected spanning subgraphs with minimum average weight. We show that the problems are NP-hard for k > 1. Approximation algorithms are given for four versions of the minimum average edge weight problem: 1. 3-approximation for k-edge-connectivity, 2. O(logk) approximation for k-node-connectivity 3. 2+ approximation for k-node-connectivity in Euclidian graph...
متن کاملMinimum Face-Spanning Subgraphs of Plane Graphs
A plane graph is a planar graph with a fixed embedding. Let G = (V,E) be an edge weighted connected plane graph, where V and E are the set of vertices and edges, respectively. Let F be the set of faces of G. For each edge e ∈ E, let w(e) ≥ 0 be the weight of the edge e of G. A face-spanning subgraph of G is a connected subgraph H induced by a set of edges S ⊆ E such that the vertex set of H con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007